S-matrix bootstrap in 3+1 dimensions: regularization and dual convex problem
نویسندگان
چکیده
A bstract The S-matrix bootstrap maps out the space of S-matrices allowed by analyticity, crossing, unitarity, and other constraints. For 2 → scattering matrix S such is an infinite dimensional convex whose boundary can be determined maximizing linear functionals. On interesting theories found, many times at vertices space. Here we consider 3 + 1 focus on equivalent dual minimization problem that provides strict upper bounds for regularized primal has practical physical advantages over problem. Its variables are partial waves k ℓ ( s ) free variables, namely they do not have to obey any unitarity or Nevertheless directly related f ), which all symmetry properties result from minimization. Numerically, it requires only a few waves, much as one wants possibly match experimental results. We case scalar fields pion physics.
منابع مشابه
Bootstrap-Based Regularization for Low-Rank Matrix Estimation
We develop a flexible framework for low-rank matrix estimation that allows us to transform noise models into regularization schemes via a simple bootstrap algorithm. Effectively, our procedure seeks an autoencoding basis for the observed matrix that is stable with respect to the specified noise model; we call the resulting procedure a stable autoencoder. In the simplest case, with an isotropic ...
متن کاملSolving Fully Fuzzy Dual Matrix System With Optimization Problem
In this paper, the fuzzy dual matrix system as AX + B = CX + D in which A, B, C, D, X are LR fuzzy matrices is studied. At first we solve 1-cut system in order to find the core of LR fuzzy solution; then to obtain the spreads of the LR fuzzy solution, we discuss in several cases. The spreads are obtained by using multiplication, quasi norm and minimization problem with a special objective funct...
متن کاملSiegel ’ s Problem in Three Dimensions
We discuss our recent solution to Siegel’s 1943 problem concerning the smallest co-volume lattices of hyperbolic 3-space. Over the last few decades the theory of Kleinian groups—discrete groups of isometries of hyperbolic 3-space—has flourished because of its intimate connectionswith low-dimensional topology and geometry and has been inspired by thediscoveries ofW. P. Thurston. The culminationm...
متن کاملBootstrap Percolation in High Dimensions
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A ⊂ V (G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected neighbours. The set A is said to percolate if eventually all vertices are infected. Our aim is to understand this process on the grid, [n], for arbitrary functions n = n(t)...
متن کاملBootstrap Percolation in Three Dimensions
Abstract. By bootstrap percolation we mean the following deterministic process on a graph G. Given a set A of vertices ‘infected’ at time 0, new vertices are subsequently infected, at each time step, if they have at least r ∈ N previously infected neighbours. When the set A is chosen at random, the main aim is to determine the critical probability pc(G, r) at which percolation (infection of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2021
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep08(2021)125